منابع مشابه
A Note on Variable-Length Codes with Constant Hamming Weights
A recent paper described a variable-length integer code based on the Goldbach conjecture where every codeword had exactly 2 1-bits but with an extremely irregular structure. A later, unpublished, work produced a much more regular code, again with a Hamming weight of 2. This paper extends that later work to weight-3 and weight-4 codes, which are shown to be competitive with more-usual codes over...
متن کاملMultilabel Prediction with Probability Sets: The Hamming Loss Case
In this paper, we study how multilabel predictions can be obtained when our uncertainty is described by a convex set of probabilities. Such predictions, typically consisting of a set of potentially optimal decisions, are hard to make in large decision spaces such as the one considered in multilabel problems. However, we show that when considering the Hamming loss, an approximate prediction can ...
متن کاملGeneralization Regions in Hamming Negative Selection
Negative selection is an immune-inspired algorithm which is typically applied to anomaly detection problems. We present an empirical investigation of the generalization capability of the Hamming negative selection, when combined with the r-chunk affinity metric. Our investigations reveal that when using the rchunk metric, the length r is a crucial parameter and is inextricably linked to the inp...
متن کاملVariable selection with neural networks
In this paper, we present 3 different neural network-based methods to perform variable selection. OCD Optimal Cell Damage is a pruning method, which evaluates the usefulness of a variable and prunes the least useful ones (it is related to the Optimal Brain Damage method of J_.e Cun et al.). Regularization theory proposes to constrain estimators by adding a term to the cost function used to trai...
متن کاملOn Permutation Masks in Hamming Negative Selection
Abstract. Permutation masks were proposed for reducing the number of holes in Hamming negative selection when applying the r-contiguous or r-chunk matching rule. Here, we show that (randomly determined) permutation masks re-arrange the semantic representation of the underlying data and therefore shatter self-regions. As a consequence, detectors do not cover areas around self regions, instead th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2018
ISSN: 0090-5364
DOI: 10.1214/17-aos1572